On Interactive Evolutionary Algorithms and Stochastic Mealy Automata
نویسنده
چکیده
Interactive evolutionary algorithms IEAs are special cases of interactive optimization methods Potential applications range from multicriteria optimization to the support of rapid prototyping in the eld of design In order to provide a theoretical framework to analyze such evolutionary methods the IEAs are formalized as stochastic Mealy automata The potential impacts of such a formalization are discussed
منابع مشابه
A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms
Due to the increasing amount of natural disasters such as earthquakes and floods and unnatural disasters such as war and terrorist attacks, Humanitarian Relief Chain (HRC) is taken into consideration of most countries. Besides, this paper aims to contribute humanitarian relief chains under uncertainty. In this paper, we address a humanitarian logistics network design problem including local dis...
متن کاملFinite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advantages can be gained by utilizing another type of automata, the Mealy machine. Mealy machines are more powerful than Moore machines, provide a richer structure that can be exploited by solution methods, and can be easily...
متن کاملNFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions
A conservative extension to traditional nondeterministic finite automata is proposed to keep track of the positions in the input string for the last uses of selected transitions, by adding ”tags” to transitions. The resulting automata are reminiscent of nondeterministic Mealy machines. Formal semantics of automata with tagged transitions is given. An algorithm is given to convert these augmente...
متن کاملImproving Model Inference of Black Box Components having Large Input Test Set
The deterministic finite automata (DFA) learning algorithm L∗ has been extended to learn Mealy machine models which are more succinct for input/output (i/o) based systems. We propose an optimized learning algorithm L1 to infer Mealy models of software black box components. The L1 algorithm uses a modified observation table and avoids adding unnecessary elements to its columns and rows. The prop...
متن کاملAutomata Learning: A Categorical Perspective
Automata learning is a known technique to infer a finite state machine from a set of observations. In this paper, we revisit Angluin’s original algorithm from a categorical perspective. This abstract view on the main ingredients of the algorithm lays a uniform framework to derive algorithms for other types of automata. We show a straightforward generalization to Moore and Mealy machines, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996